Effect of algorithms that improve fairness of TCP congestion avoidance on performance of slow links and long thin networks

The bias of TCP’s congestion avoidance mechanism against connections with long Round Trip Times (RTT) is a known fact. Many alternate congestion avoidance policies have been proposed to improve the fairness. Though the proposed policies attempt to address and resolve the fairness issue, we show in this paper that they tend to be harmful to connections that traverse either slow links like 56Kbps modem links or Long Thin Networks (LTN) like the cellular links. We specifically consider a very common scenario where the last-hop link connecting the end user (i.e., client) may be a slow link or a LTN. In this case, the TCP sender (i.e., server) is usually unaware of the network path and when it is equipped with such policies it would cause an increased probing into the network in a quest for the non-existent bandwidth. In this paper we conduct simulation studies to evaluate the impact of the proposed policies on the connections that traverse either slow links or LTNs. We notice that the proposed policies cause increased buffer overflows at the last-hop router, thereby degrading the performance of the connection. We study the impact of increased buffer sizes at lasthop router and also the effect of advertising a limited receive window. We show that the impact of the policies, on connections traversing slow links or LTNs, can be reduced by selectively disabling the policies.